A Solution to Bipartite Drawing Problem Using Genetic Algorithm

Crossing minimization problem in a bipartite graph is a well-known NP-Complete problem. Drawing the directed/undirected graphs such that they are easy to understand and remember requires some drawing aesthetics and crossing minimization is one of them. In this paper, we investigate an intelligent evolutionary technique i.e. Genetic Algorithm (GA) for bipartite drawing problem (BDP). Two techniques GA1 and GA2 are proposed based on Genetic Algorithm. It is shown that these techniques outperform previously known heuristics e.g., MinSort (M-Sort) and BaryCenter (BC) as well as a genetic algorithm based level permutation problem (LPP), especially when applied to low density graphs. The solution is tested over various parameter values of genetic bipartite drawing problem. Experimental results show the promising capability of the proposed solution over previously known heuristics.